How does a Call Stack work in programming?

Call Stack

javascript

1
Function calls push new frames onto the call stack.
2
Returning from a function pops its frame.
3
Nested calls naturally follow LIFO behavior.
4
Recursive functions create multiple frames until the base case is reached.
5
Excessive recursion can cause StackOverflowError or an equivalent stack-overflow condition.
6
The exact contents and layout of a frame are runtime and architecture dependent.

Difficulty: 6/10

Topics: Memory Management, Recursion & Iteration, Runtime Environments

0-2 years experience

1
We have a recursive function processing a deeply nested JSON tree, and it suddenly crashes with a 'Maximum call stack size exceeded' error on larger payloads. How would you modify this function to prevent this crash while still processing the entire tree?
2
Imagine you're looking at a production error log with a 20-line stack trace. Walk me through how you read this trace to pinpoint exactly where the error originated and how the application reached that state.

2-5 years experience

1
In JavaScript, running a heavy synchronous loop blocks the UI, but wrapping parts of it in setTimeout or Promise.resolve doesn't. How does the call stack interact with the event loop here, and how would you refactor a blocking CPU-intensive task to keep the UI responsive?
2
We are porting a deeply recursive tree-traversal algorithm to an environment with a very strict, small stack limit (like an embedded system or a constrained serverless function). How would you rewrite this to use an explicit stack on the heap instead of the call stack, and what are the tradeoffs?

5-8 years experience

1
We are building a lightweight scripting engine for our platform's plugin system. How would you design the execution context and call stack mechanism to support nested function calls, local variable scoping, and safe error propagation without crashing the host process?
2
When debugging a hard crash in a multi-threaded C++ or Rust service, you notice a stack overflow in one of the worker threads. How do you determine if the issue is due to excessive local variable allocation (large stack frames) versus deep recursion, and how would you configure thread stack sizes or heap allocations to resolve it?

8+ years experience

1
Our platform supports user-defined rules executed via WebAssembly or a custom VM. To prevent denial-of-service attacks from infinite recursion or massive stack allocations, how would you architect the runtime's stack-budgeting and resource-limiting boundaries at the compiler or VM level?
2
We are migrating a legacy monolithic system to a highly concurrent, non-blocking reactive framework (like Akka or Project Loom virtual threads). How does the shift from OS-thread-bound call stacks to virtual/managed stacks impact our distributed tracing, logging context (like MDC), and debugging workflows across teams?

❓What actually gets stored inside a single stack frame, and how does the CPU know where to return after a function finishes?
❓How does tail-call optimization (TCO) prevent stack growth, and why isn't it supported in all major runtimes?
❓If you replace the call stack with a heap-allocated stack structure, what are the performance and cache-locality implications?